Second-Order Optimality Conditions for Vector Problems with Continuously Fréchet Differentiable Data and Second-Order Constraint Qualifications
نویسندگان
چکیده
منابع مشابه
Second- and First-Order Optimality Conditions in Vector Optimization
In this paper we obtain secondand first-order optimality conditions of Kuhn-Tucker type and Fritz John one for weak efficiency in the vector problem with inequality constraints. In the necessary conditions we suppose that the objective function and the active constraints are continuously differentiable. We introduce notions of KTSP-invex problem and second-order KTSP-invex one. We obtain that t...
متن کاملSecond order optimality conditions for bang – bang control problems
Second order necessary and sufficient optimality conditions for bang–bang control problems have been studied in Milyutin, Osmolovskii (1998). These conditions amount to testing the positive (semi–)definiteness of a quadratic form on a critical cone. The assumptions are appropriate for numerical verification only in some special cases. In this paper, we study various transformations of the quadr...
متن کاملSufficient Second Order Optimality Conditions for C Multiobjective Optimization Problems
In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C, but not necessarily of class C.
متن کاملNew second-order optimality conditions in multiobjective optimization problems: Differentiable case
To get positive Lagrange multipliers associated with each of the objective function, Maeda [Constraint qualification in multiobjective optimization problems: Differentiable case, J. Optimization Theory Appl., 80, 483–500 (1994)], gave some special sets and derived some generalized regularity conditions for first-order Karush–Kuhn– Tucker (KKT)-type necessary conditions of multiobjective optimiz...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2015
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-015-0718-8